Towards optimal softening in 3 D N - body codes : I . Minimizing the force error

نویسنده

  • Walter Dehnen
چکیده

In N -body simulations of collisionless stellar systems, the forces are softened to reduce the large fluctuations due to shot noise. Softening essentially modifies the law of gravity at r = |xi − xj | smaller than some softening length ǫ. Therefore, the softened forces are increasingly biased for ever larger ǫ, and there is some optimal ǫ which yields the best compromise between reducing the fluctuations and introducing a bias. Here, analytical relations are derived for the amplitudes of the bias and the fluctuations in the limit of ǫ being much smaller than any physical scale of the underlying stellar system. In particular, it is shown that the fluctuations of the force are generated locally, in contrast to the variations of the potential, which originate from noise in the whole system. Based on these asymptotic relations and using numerical simulations, I study the dependence of the resulting force error on the number of bodies, the softening length, and on the functional form by which Newtonian gravity is replaced. The widely used Plummer softening, where each body is replaced by a Plummer sphere of scale radius ǫ, yields significantly larger force errors than do methods in which the bodies are replaced by density kernels of finite extent. I also give special kernels, which reduce the errors even further. These kernels largely compensate the errors made with too small inter-particle forces at r < ǫ by exceeding Newtonian forces at r ∼ ǫ. Additionally, the possibilities of locally adapting ǫ and of using unequal weights for the bodies are investigated. By using these various techniques without increasing N , the rms force error can be reduced by a factor ∼ 2 when compared to the standard Plummer softening with constant ǫ. The results of this study are directly relevant to N -body simulations using direct summation techniques or the tree code for force evaluation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Softening for N -body Halo Simulations

We propose to determine the optimal softening length in N -body halo simulations by minimizing the ensemble-average acceleration error at a small radius r0. This strategy ensures that the error never exceeds the optimal value beyond r0. Furthermore, we derive semi-analytic formulae for calculating the acceleration error due to the discreteness of particles and softened gravity, which are valida...

متن کامل

An energy-conserving formalism for adaptive gravitational force softening in SPH and N−body codes

In this paper we describe an adaptive softening length formalism for collisionless N−body and self-gravitating Smoothed Particle Hydrodynamics (SPH) calculations which conserves momentum and energy exactly. This means that spatially variable softening lengths can be used in N−body calculations without secular increases in energy. The formalism requires the calculation of a small additional term...

متن کامل

Optimal Softening for N -body Simulations

We propose a strategy for determining the optimal softening length in N -body simulations. This strategy ensures that the ensemble-average acceleration error is minimal at a small radius r0, and that the error never exceeds the optimal value beyond r0. Analytic formulae are derived for calculating the acceleration error for any halo profile or softened gravity so that the optimal softening leng...

متن کامل

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000